Existence theory and Q-matrix characterization for the generalized linear complementarity problem
نویسندگان
چکیده
منابع مشابه
A Quadratically Convergent Interior-Point Algorithm for the P*(κ)-Matrix Horizontal Linear Complementarity Problem
In this paper, we present a new path-following interior-point algorithm for -horizontal linear complementarity problems (HLCPs). The algorithm uses only full-Newton steps which has the advantage that no line searchs are needed. Moreover, we obtain the currently best known iteration bound for the algorithm with small-update method, namely, , which is as good as the linear analogue.
متن کاملa quadratically convergent interior-point algorithm for the p*(κ)-matrix horizontal linear complementarity problem
in this paper, we present a new path-following interior-point algorithm for -horizontal linear complementarity problems (hlcps). the algorithm uses only full-newton steps which has the advantage that no line searchs are needed. moreover, we obtain the currently best known iteration bound for the algorithm with small-update method, namely, , which is as good as the linear analogue.
متن کاملOn Smoothing Methods for the P0 Matrix Linear Complementarity Problem
In this paper, we propose a Big-? smoothing method for solving the P 0 matrix linear complementarity problem. We study the trajectory deened by the augmented smoothing equations and global convergence of the method under an assumption that the original P 0 matrix linear complementarity problem has a solution. The method has been tested on the P 0 matrix linear complementarity problem with unbou...
متن کاملTheory for the Matrix Linear Programming Problem
Multiple objective linear programming, also known as the linear vector maximization problem, has been studied by a number of authors. In particular, its duality theory has been considered by Philip [9], Isermann [7], Gray and Sutherland [5], Brumelle [1], and Ponstein [10]. Neither the symmetry nor all the relationships of the duality theory of conventional linear programming, however, have bee...
متن کاملSimple Stochastic Games and P-Matrix Generalized Linear Complementarity Problems
We show that the problem of finding optimal strategies for both players in a simple stochastic game reduces to the generalized linear complementarity problem (GLCP) with a P-matrix, a well-studied problem whose hardness would imply NP = co-NP. This makes the rich GLCP theory and numerous existing algorithms available for simple stochastic games. As a special case, we get a reduction from binary...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1995
ISSN: 0024-3795
DOI: 10.1016/0024-3795(95)00091-5